We make a brief summary about the clustering algorithms of data mining , and make an detail study about the clustering algorithms for high - dimension and complex data . secondly , a new algorithm based on the idea of coverage density is proposed for clustering categorical data 本文首先介紹了數(shù)據(jù)挖掘研究的相關(guān)背景,對數(shù)據(jù)挖掘中的聚類分析的相關(guān)工作作了一個簡要的概述,并對處理高維數(shù)據(jù)的聚類算法進(jìn)行了較為深入的分析研究。